Definition of Laplace-stieltjes Transform for the Ergodic Distribution of the Semi-markov Random Process
نویسنده
چکیده
In this paper we will investigate the semi-markov random processes with positive tendency, negative jumps and delaying boundary at zero in this article. The Laplace transform on time, Laplace-Stieltjes transform on phase of the conditional and unconditional distributions and Laplace-Stieltjes transform of the ergodic distribution are defined. The characteristics of the ergodic distribution will be calculated on the basis of the final results. Mathematics Subject Classification 60A10, 60J25, 60G50
منابع مشابه
Transient Cost Analysis of Non-Markovian Software Systems with Rejuvenation
In this paper, we perform the transient analysis of software cost models with periodic/non-periodic rejuvenation. We derive the Laplace-Stieltjes transforms of the ergodic probabilities for respective semi-Markov and Markov regenerative process models, and evaluate numerically the expected cumulative costs experienced by an arbitrary time and its time average by using the Laplace inversion tech...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملDistributions of Reward Functions on Continuous-time Markov Chains
We develop algorithms for the computation of the distribution of the total reward accrued during [0, t) in a finite continuous-parameter Markov chain. During sojourns, the reward grows linearly at a rate depending on the state visited. At transitions, there can be instantaneous rewards whose values depend on the states involved in the transition. For moderate values of t, the reward distributio...
متن کاملThe Bm Ap=g=1 Vacation Queue with Queue–length Dependent Vacation Schedule
We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...
متن کاملTail Probability and Singularity of Laplace-Stieltjes Transform of a Heavy Tailed Random Variable
In this paper, we will give a sufficient condition for a non-negative random variable X to be heavy tailed by investigating the Laplace-Stieltjes transform of the probability distribution function. We focus on the relation between the singularity at the real point of the axis of convergence and the asymptotic decay of the tail probability. Our theorem is a kind of Tauberian theorems.
متن کامل